Considering pricing and uncertainty in designing a reverse logistics network

- Zamani, Mohsen, Abolghasemi, Mahdi, Hosseini, Seyed Mohammad Seyed, Pishvaee, Mir Samen

Incremental network design with minimum spanning trees

- Engel, Konrad, Kalinowski, Thomas, Savelsbergh, Martin W. P.

MaxDDBS problem on Beneš networks

- Bong, Novi H., Ryan, Joe, Sugeng, Kiki A.

Incremental network design with maximum flows

- Kalinowski, Thomas, Matsypura, Dmytro, Savelsbergh, Martin W. P.

Degree diameter problem on honeycomb networks

- Holub, Přemysl, Miller, Mirka, Pérez-Rosés, Hebert, Ryan, Joe

Incremental network design with shortest paths

- Baxter, Matthew, Elgindy, Tarek, Ernst, Andreas T., Kalinowski, Thomas, Savelsbergh, Martin W. P.

Searching for large multi-loop networks

- Feria-Purón, Ramiro, Ryan, Joe, Pérez-Rosés, Hebert

Improved load plan design through integer programming based local search

- Erera, Alan, Hewitt, Michael, Savelsbergh, Martin, Zhang, Yang

Large networks bounded in degree and diameter

- Pérez-Rosés, Hebert

The maximum degree & diameter-bounded subgraph and its applications

- Dekker, Anthony, Perez-Roses, Hebert, Pineda-Villavicencio, Guillermo, Watters, Paul

The maximum degree and diameter-bounded subgraph in the mesh

- Miller, Mirka, Pérez-Rosés, Hebert, Ryan, Joe